// @before-stub-for-debug-begin
#include <vector>
#include <string>
#include "commoncppproblem697.h"

using namespace std;
// @before-stub-for-debug-end

/*
 * @lc app=leetcode.cn id=697 lang=cpp
 *
 * [697] 数组的度
 */

// @lc code=start
class Solution {
public:
    int findShortestSubArray(vector<int>& nums) {
        if(nums.size == 0)
            return 0;

        int hash[50000];
        memset(hash, 0, sizeof(hash));
        for (int i = 0; i < nums.size();i++)
        {
            hash[nums[i]]++;
        }

        int max = 0
        for (int i = 0; i < 50000;i++)
        {
            if(hash[i] > hash[max])
                max = 
        }
        }
};
// @lc code=end

